Sparsity optimized high order finite element functions on simplices
نویسنده
چکیده
This article reports several results on sparsity optimized basis functions for hp-FEM on triangular and tetrahedral finite element meshes obtained within the Special Research Program “Numerical and Symbolic Scientific Computing” and within the Doctoral Program “Computational Mathematics” both supported by the Austrian Science Fund FWF under the grants SFB F013 and DK W1214, respectively. We give an overview on the sparsity pattern for mass and stiffness matrix in the spaces L2, H1, H(div) and H(curl). The construction relies on a tensor-product based construction with properly weighted Jacobi polynomials.
منابع مشابه
Sparsity optimized high order finite element functions for H(div) on simplices
This paper deals with conforming high-order finite element discretizations of the vectorvalued function space H(div) in 2 and 3 dimensions. A new set of hierarchic basis functions on simplices with the following two main properties is introduced. When working with an affine, simplicial triangulation, first, the divergence of the basis functions is L2-orthogonal, and secondly, the L2-inner produ...
متن کاملSparsity optimized high order finite element functions for H(curl) on tetrahedra
H(curl) conforming finite element discretizations are a powerful tool for the numerical solution of the system of Maxwell’s equations in electrodynamics. In this paper we construct a basis for conforming high-order finite element discretizations of the function space H(curl) in 3 dimensions. We introduce a set of hierarchic basis functions on tetrahedra with the property that both the L-inner p...
متن کاملSymmetrie Hierarchical Polynomials and the Adaptive H-p-version Symmetrie Hierarchical Polynomials and the Adaptive H-p-version
Absac The h-p-version of finite-elements delivers a sub-exponential conver gence in the energy norm. A step towards a full adaptive implementation is taken in the context of unstructured meshes of simplices with variable order p in space. Both assumptions lead to desirable properties of shape functions like symmetry, p-hierarchy and simple coupling of elements. In a first step it is demonstrate...
متن کاملFinite Element Interpolation of Nonsmooth Functions
In this paper, we propose a modified Lagrange type interpolation operator to approximate functions in Sobolev spaces by continuous piecewise polynomials. In order to define interpolators for "rough" functions and to preserve piecewise polynomial boundary conditions, the approximated functions are averaged appropriately either on dor (d 1 )-simplices to generate nodal values for the interpolatio...
متن کاملLow-Complexity Finite Element Algorithms for the de Rham Complex on Simplices
We combine recently-developed finite element algorithms based on Bernstein polynomials [1, 14] with the explicit basis construction of the finite element exterior calculus [5] to give a family of algorithms for the Rham complex on simplices that achieves stiffness matrix construction and matrix-free action in optimal complexity. These algorithms are based on realizing the exterior calculus base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011